Algebraic Shift Register Sequences
نویسندگان
چکیده
Pseudo-random sequences are essential ingredients of every modern digital communication system including cellular telephones, GPS, secure internet transactions, and satellite imagery. Each application requires pseudo-random sequences with specific statistical properties. This book describes the design, mathematical analysis, and implementation of pseudo-random sequences, particularly those generated by shift registers and related architectures, such as feedback with carry shift registers. The earlier chapters may be used as a textbook in an advanced undergraduate mathematics course or a graduate electrical engineering course; the more advanced chapters provide a reference work for researchers in the field. Background material from algebra, beginning with elementary group theory, is provided in an appendix.
منابع مشابه
Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes
In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based on the algebra of π-adic numbers, where π is an element in a ring R, and produce sequences of elements in R/(π). We give several cases where the register synthesis problem can be solved by an efficient algorithm. Conseq...
متن کاملAlgebraic Feedback Shift Registers Based on Function Fields
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations of linear feedback shift registers. We describe conditions under which such AFSRs produce sequences with various ideal randomness properties. We also show that there is an efficient algorithm which, given a prefix of a s...
متن کاملPolynomial pseudo-noise sequences based on algebraic feedback shift registers
We apply the framework of algebraic feedback shift registers to polynomial rings over finite fields. This gives a construction of new pseudorandom sequences (over non-prime finite fields), which satisfy Golomb’s three randomness criteria.
متن کاملLarge Period Nearly deBruijn FCSR Sequences ( Extended
Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. Jn this paper we exhibit a tpchnique for easily fi...
متن کاملLarge Period Nearly deBruijn FCSR Sequences
Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. In this paper we exhibit a technique for easily fi...
متن کامل